In order to solve the node localization problem in wireless sensor networks, we propose a novel distributed weighted search\nlocalization algorithm (WSLA) in this paper. The WSLA adopts a modified received signal strength indicator-based range model\nto estimate the distances between nodes, utilizes the results of a centroid localization algorithm as the search initial point, and\nemploys a new weighted search method to compute the positions of nodes in a distributed and recursive manner. The key ideas\nof the WSLA include a node localization precision classification scheme, a processing scheme for special nodes, and weight-based\nsearches. Compared with three state-of-art localization algorithmsââ?¬â?namely, maximum likelihood estimation (MLE), edge-based\nsecond-order cone programming + nonconvex sequential greedy (ESOCP + NCSG), and particle swarm optimization (PSO)ââ?¬â?the\nsimulation results show that localization performance of the WSLA is superior to that of MLE, ESOCP + NCSG, and PSO.
Loading....